A modified generalized shift-splitting preconditioner for nonsymmetric saddle point problems
نویسندگان
چکیده
منابع مشابه
On the generalized shift-splitting preconditioner for saddle point problems
In this paper, the generalized shift-splitting preconditioner is implemented for saddle point problems with symmetric positive definite (1,1)-block and symmetric positive semidefinite (2,2)-block. The proposed preconditioner is extracted form a stationary iterative method which is unconditionally convergent. Moreover, a relaxed version of the proposed preconditioner is presented and some proper...
متن کاملA Parameterized Splitting Preconditioner for Generalized Saddle Point Problems
By using Sherman-Morrison-Woodbury formula, we introduce a preconditioner based on parameterized splitting idea for generalized saddle point problems which may be singular and nonsymmetric. By analyzing the eigenvalues of the preconditioned matrix, we find that when α is big enough, it has an eigenvalue at 1 with multiplicity at least n, and the remaining eigenvalues are all located in a unit c...
متن کاملA Preconditioner for Generalized Saddle Point Problems
In this paper we consider the solution of linear systems of saddle point type by preconditioned Krylov subspace methods. A preconditioning strategy based on the symmetric/ skew-symmetric splitting of the coefficient matrix is proposed, and some useful properties of the preconditioned matrix are established. The potential of this approach is illustrated by numerical experiments with matrices fro...
متن کاملA BDDC Preconditioner for Saddle Point Problems
The purpose of this paper is to extend the BDDC (balancing domain decomposition by constraints) algorithm to saddle point problems that arise when mixed finite element methods are used to approximate the system of incompressible Stokes equations. The BDDC algorithms are defined in terms of a set of primal continuity constraints, which are enforced across the interface between the subdomains, an...
متن کاملA modification of the generalized shift-splitting method for singular saddle point problems
A modification of the generalized shift-splitting (GSS) method is presented for solving singular saddle point problems. In this kind of modification, the diagonal shift matrix is replaced by a block diagonal matrix which is symmetric positive definite. Semiconvergence of the proposed method is investigated. The induced preconditioner is applied to the saddle point problem and the preconditioned...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Numerical Algorithms
سال: 2017
ISSN: 1017-1398,1572-9265
DOI: 10.1007/s11075-017-0377-y